- Boolean mathematics
- булева алгебра

*The English-Russian dictionary on reliability and quality control.
2015.*

- Boolean mathematics
- булева алгебра

*The English-Russian dictionary on reliability and quality control.
2015.*

**Boolean algebras canonically defined**— Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia**Boolean algebra (introduction)**— Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia**Boolean logic**— is a complete system for logical operations. It was named after George Boole, who first defined an algebraic system of logic in the mid 19th century. Boolean logic has many applications in electronics, computer hardware and software, and is the… … Wikipedia**mathematics, foundations of**— Scientific inquiry into the nature of mathematical theories and the scope of mathematical methods. It began with Euclid s Elements as an inquiry into the logical and philosophical basis of mathematics in essence, whether the axioms of any system… … Universalium**Boolean algebra**— This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia**Boolean algebra (structure)**— For an introduction to the subject, see Boolean algebra#Boolean algebras. For the elementary syntax and axiomatics of the subject, see Boolean algebra (logic). For an alternative presentation, see Boolean algebras canonically defined. In abstract … Wikipedia**Boolean satisfiability problem**— For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia**Boolean prime ideal theorem**— In mathematics, a prime ideal theorem guarantees the existence of certain types of subsets in a given abstract algebra. A common example is the Boolean prime ideal theorem, which states that ideals in a Boolean algebra can be extended to prime… … Wikipedia**Boolean-valued function**— A boolean valued function, in some usages a predicate or a proposition, is a function of the type f : X → B, where X is an arbitrary set and where B is a boolean domain.A boolean domain B is a generic 2 element set, say, B = {0, 1}, whose… … Wikipedia**Boolean domain**— In mathematics and abstract algebra, a Boolean domain is a set consisting of exactly two elements whose interpretations include false and true . In mathematics and theoretical computer science, a Boolean domain is usually written as {0,1} or {ot … Wikipedia**Boolean algebra (logic)**— For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… … Wikipedia